Weak Coherence and the K -theory of Groups with Finite Decomposition Complexity

نویسنده

  • BORIS GOLDFARB
چکیده

The weak regular coherence is a coarse property of a finitely generated group Γ. It was introduced by G. Carlsson and this author to play the role of a weakening of Waldhausen’s regular coherence as part of computation of the integral K-theoretic assembly map. A new class of metric spaces (sFDC) was introduced recently by A. Dranishnikov and M. Zarichnyi. This class includes most notably the spaces with finite decomposition complexity (FDC) studied by E. Guentner, D. Ramras, R. Tessera, and G. Yu. The main theorem of this paper shows that a group that has finite K(Γ, 1) and sFDC is weakly regular coherent. As a consequence, the integral K-theoretic assembly maps are isomorphisms in all dimensions for any group that has finite K(Γ, 1) and FDC. In particular, the Whitehead group Wh(Γ) is trivial for such groups.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Coherence of Groups and Finite Decomposition Complexity

The weak regular coherence (WRC) property of a finitely generated group Γ was introduced by G. Carlsson and this author to play the role of a weakening of Waldhausen’s regular coherence as part of computation of the integral K-theoretic assembly map. This property is a coarse invariant of the word metric. It was shown that groups with finite asymptotic dimension (FAD) have this property. A new ...

متن کامل

OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS

In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...

متن کامل

A Comparative Study of Least-Squares and the Weak-Form Galerkin Finite Element Models for the Nonlinear Analysis of Timoshenko Beams

In this paper, a comparison of weak-form Galerkin and least-squares finite element models of Timoshenko beam theory with the von Kármán strains is presented. Computational characteristics of the two models and the influence of the polynomial orders used on the relative accuracies of the two models are discussed. The degree of approximation functions used varied from linear to the 5th order. In ...

متن کامل

Application of Laplace decomposition method for Burgers-Huxley and Burgers-Fisher equations

In this paper, we apply the Laplace decomposition method to obtain a series solutions of the Burgers-Huxley and Burgers-Fisher equations. The technique is based on the application of Laplace transform to nonlinear partial differential equations. The method does not need linearization, weak nonlinearity assumptions or perturbation theory and the nonlinear terms can be easily handled by using the...

متن کامل

Weak signed Roman k-domination in graphs

Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014